PALOMA: A Process Algebra for Located Markovian Agents

نویسندگان

  • Cheng Feng
  • Jane Hillston
چکیده

We present a novel stochastic process algebra that allows the expression of models representing systems comprised of populations of agents distributed over space, where the relative positions of agents influence their interaction. This language, PALOMA, is given both discrete and continuous semantics and it captures multi-class, multi-message Markovian agent models (MMAM). Here we present the definition of the language and both forms of semantics, and demonstrate the use of the language to model a flu epidemic under various quarantine regimes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Markovian Process Algebra : Composition and Equivalence

Markovian Process Algebra (MPA) is a process algebra enhanced with exponential timing which allows the mapping of speciications on continuous time Markov chains (CTMCs). This paper introduces a compositional approach to compute the generator matrix of the CTMC underlying a MPA speciication which consists of the parallel composition of nite state agents. Furthermore two diierent equivalence rela...

متن کامل

Stochastic and Spatial Equivalences for PALOMA

We concentrate our study on a recent process algebra – PALOMA – intended to capture interactions between spatially distributed agents, for example in collective adaptive systems. New agent-based semantic rules for deriving the underlying continuous time Markov chain are given in terms of State to Function Labelled Transition Systems. Furthermore we define a bisimulation with respect to an isome...

متن کامل

Using Markovian Process Algebra to Specify Interactions in Queueing Systems

The advantages of using stochastic process algebra to specify performance models are well-documented. There remains, however, a reluctance in some quarters to use process algebras; this is particularly the case amongst queueing theorists. This paper demonstrates the use of a Markovian process algebra to represent a wide range of queueing models. Moreover, it shows that the most common interacti...

متن کامل

Reduction semantics in Markovian process algebra

Stochastic (Markovian) process algebra extend classical process algebra with probabilistic exponentially distributed time durations denoted by rates (the parameter of the exponential distribution). Defining a semantics for such an algebra, so to derive Continuous Time Markov Chains from system specifications, requires dealing with transitions labeled by rates. With respect to standard process a...

متن کامل

Extended Markovian Process Algebra: A Case Study

Extended Markovian Process Algebra (EMPA) is a process algebra suitable for expressing functional and performance aspects of concurrent systems. It is equipped with an operational interleaving semantics, a functional semantics, a Markovian semantics and an operational net semantics. In this paper we apply an integrated approach based on EMPA for mod-eling and analyzing concurrent systems to the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014